Computing the minimal relations in point-based qualitative temporal reasoning through metagraph closure

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure

Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper we propose a new approach to solving this task which exploits the timegraph representation of a CSP over PA. A timegraph is a graph partitioned into a set of chains on which the search is supported by a metagraph data structure...

متن کامل

Point-Based Approaches to Qualitative Temporal Reasoning

We address the general problem of finding algorithms for efficient, qualitative, point-based temporal reasoning over a set of operations. We consider general reasoners tailored for temporal domains that exhibit a particular structure and introduce such a reasoner based on the series-parallel graph reasoner of Delgrande and Gupta; this reasoner is also an extension of the TimeGraph reasoner of G...

متن کامل

A comparison of point-based approaches to qualitative temporal reasoning

We address the problem of implementing general, qualitative, point-based temporal reasoning. Given a database of assertions concerning relative occurrences of points in time, we are interested in various operations on this database, including compiling the assertions into a representation that supports eecient reasoning, determining whether a database is consistent, and computing the strongest ...

متن کامل

An Algebra of Granular Temporal Relations for Qualitative Reasoning

In this paper, we propose a qualitative formalism for representing and reasoning about time at different scales. It extends the algebra of Euzenat [2001] and overcomes its major limitations, allowing one to reason about relations between points and intervals. Our approach is more expressive than the other algebras of temporal relations: for instance, some relations are more relaxed than those i...

متن کامل

Exact and Approximate Reasoning about Qualitative Temporal Relations

Much temporal information is qualitative information such as ‘‘The Cuban Missile crisis took place during Kennedy’s presidency,’’ where only the ordering of the end points of the two events is specified. A point and an interval algebra have been proposed for representing qualitative temporal information about the relationships between pairs of intervals and pairs of points, respectively. In thi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Artificial Intelligence

سال: 2011

ISSN: 0004-3702

DOI: 10.1016/j.artint.2010.10.004